Relatively best Chebyshev approximations to exp(t)
نویسندگان
چکیده
منابع مشابه
Chebyshev Approximations to the Histogram χ Kernel
The random Fourier features methodology can be used to approximate the performance of kernel classifiers in linear time in the number of training examples. However, there still exists a non-trivial performance gap between the approximation and the nonlinear kernel classifiers, especially for the exponential χ kernel, one of the most powerful models for histograms. Based on analogies with Chebys...
متن کاملChebyshev approximations to the histogram χ2 kernel
The random Fourier embedding methodology can be used to approximate the performance of non-linear kernel classifiers in linear time on the number of training examples. However, there still exists a non-trivial performance gap between the approximation and the nonlinear models, especially for the exponential χ kernel, one of the most powerful models for histograms. Based on analogies with Chebys...
متن کاملChebyshev polynomial approximations for some hypergeometric systems
The hypergeometric type differential equations of the second order with polynomial coefficients and their systems are considered. The realization of the Lanczos Tau Method with minimal residue is proposed for the approximate solution of the second order differential equations with polynomial coefficients. The scheme of Tau method is extended for the systems of hypergeometric type differential e...
متن کاملAn Algorithm for Computing Continuous Chebyshev Approximations
In this paper we introduce an algorithm for computing nonlinear continuous Chebyshev approximations. The algorithm is based on successive linearizations within adaptively adjusted neighborhoods. The convergence of the algorithm is proven under some general assumptions such that it is applicable for many Chebyshev approximation problems discussed in the literature. It, like the Remez exchange me...
متن کاملNumerical Approximations Using Chebyshev Polynomial Expansions
The aim of this work is to find numerical solutions for differential equations by expanding the unknown function in terms of Chebyshev polynomials and solving a system of linear equations directly for the values of the function at the extrema (or zeros) of the Chebyshev polynomial of order N . The solutions are exact at these points, apart from round-off computer errors and the convergence of o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Approximation Theory
سال: 1978
ISSN: 0021-9045
DOI: 10.1016/0021-9045(78)90079-5